翻訳と辞書 |
Differential equations of addition : ウィキペディア英語版 | Differential equations of addition In cryptography, differential equations of addition (DEA) are one of the most basic equations related to differential cryptanalysis that mix additions over two different groups (e.g. addition modulo 232 and addition over GF(2)) and where input and output differences are expressed as XORs. == Examples of Differential Equations of Addition == Differential equations of addition (DEA) are of the following form:
where and are -bit unknown variables and , and are known variables. The symbols and denote ''addition modulo'' and ''bitwise exclusive-or'' respectively. The above equation is denoted by . Let a set denote a system of DEA where is a polynomial in . It has been proved that the satisfiability of an arbitrary set of DEA is in the complexity class P when a brute force search requires an exponential time.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Differential equations of addition」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|